The weighted farthest color Voronoi diagram on trees and graphs
نویسندگان
چکیده
! " # %$ & #' )(* +, ( *. # $/( #0 213 4 " #65/ )( 7986 $. /$ : %(* ; % ;% %$ % " =<> %(* ? @ A B$ ;% # 7DC E F % $ , =$ ;% GIH KJ L@ @ M F# 4 F F = N $ % : ;%(* # /+O #, P$ * ) Q # $ % * L@ + ) SR9 # * ) * ) ) ( #0 -T % </ ) $0 B $. ' * % U + 1V ;% * )(* W P ) # (* % * A +W @ / =</ %$0 X % / ?$ ;% Q P +W P+Y )# ) Q ,$ *;% # 7
منابع مشابه
Realizing Farthest-Point Voronoi Diagrams
1 The farthest-point Voronoi diagram of a set of n sites 2 is a tree with n leaves. We investigate whether arbi3 trary trees can be realized as farthest-point Voronoi di4 agrams. Given an abstract ordered tree T with n leaves 5 and prescribed edge lengths, we produce a set of n sites 6 S in O(n) time such that the farthest-point Voronoi di7 agram of S represents T . We generalize this algorithm...
متن کاملRheinische Friedrich - Wilhelms - Universität Bonn
Given n point sites in the plane each painted in one of k colors, the region of a c-colored site p in the Farthest Color Voronoi Diagram (FCVD) contains all points of the plane for which c is the farthest color and p the nearest c-colored site. This novel structure generalizes both the standard Voronoi diagram (k = 1) and the farthest site Voronoi diagram (k = n). We show that the FCVD has stru...
متن کاملOn the Farthest Line-Segment Voronoi Diagram
The farthest line-segment Voronoi diagram shows properties surprisingly different than the farthest point Voronoi diagram: Voronoi regions may be disconnected and they are not characterized by convexhull properties. In this paper we introduce the farthest line-segment hull, a cyclic structure that relates to the farthest line-segment Voronoi diagram similarly to the way an ordinary convex hull ...
متن کاملOn the Hausdorff and Other Cluster Voronoi Diagrams
The Voronoi diagram is a fundamental geometric structure that encodes proximity information. Given a set of geometric objects, called sites, their Voronoi diagram is a subdivision of the underlying space into maximal regions, such that all points within one region have the same nearest site. Problems in diverse application domains (such as VLSI CAD, robotics, facility location, etc.) demand var...
متن کاملInteractive Analysis Using Voronoi Diagrams: Algorithms to Support Dynamic Update from a Generic Triangle-based Data Structure
This paper describes a series of dynamic update methods that can be applied to a family of Voronoi diagram types, so that changes can be updated incrementally, without the usual recourse to complete reconstruction of their underlying data structure. More efficient incremental update methods are described for the ordinary Voronoi diagram, the farthest-point Voronoi diagram, the order-k Voronoi d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Geom.
دوره 27 شماره
صفحات -
تاریخ انتشار 2004